Polygon Cutting: Revisited
نویسندگان
چکیده
منابع مشابه
Optimal Cutting of a Polygon by Lasers
Indoor localization is a challenging and important problem. Although GPS technology is very effective for outdoor localization, it cannot be used in the indoor settings, since GPS depends on line of sight to satellites. Hence, other techniques are being developed for indoor environment. Use of lasers is one option that is being investigated to perform localization and target tracking. When mult...
متن کاملCutting Out Polygons
In this paper, we present approximation algorithms for the problem of cutting out a convex polygon P with n vertices from another convex polygon Q with m vertices by a sequence of guillotine cuts of smallest total length. Specifically, we give an O(n + m) running time, constant factor approximation algorithm, and an O(n+m) running time, O(log n)-factor approximation algorithm for cutting P out ...
متن کاملCutting a Country for Smallest Square Fit
We study the problem of cutting a simple polygon with n vertices into two pieces such that – if we reposition one piece disjoint of the other, without rotation – they have the minimum possible bounding square. If we cut with a single horizontal or vertical segment, then we can compute an optimal solution for a convex polygon with n vertices in O(n) time. For simple polygons we give an O(nα(n) l...
متن کاملDescartes Systems from Corner Cutting
Here cI . . . . . c~ are vectors (control points) in some s-dimensional linear space, say W. The control polygon is then determined by the composite vector c r R "~ and we can think of c geometrically as a polygonal line. Various algorithms for the manipulation and computation of such curves take the form of successive geometric alterations of the control polygon. In particular, in the case of ...
متن کاملMinimum Weight Triangulation by Cutting Out Triangles
We describe a fixed parameter algorithm for computing the minimum weight triangulation (MWT) of a simple polygon with (n− k) vertices on the perimeter and k hole vertices in the interior, that is, for a total of n vertices. Our algorithm is based on cutting out empty triangles (that is, triangles not containing any holes) from the polygon and processing the parts or the rest of the polygon recu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998